Interpolation theorems for intuitionistic predicate logic
نویسنده
چکیده
Craig interpolation theorem (which holds for intuitionistic logic) implies that the derivability of X,X’-¿Y’ implies existence of an interpolant I in the common language of X and X’-¿Y’ such that both X-¿I and I,X’-¿Y’ are derivable. For classical logic this extends to X,X’-¿Y,Y’, but for intuitionistic logic there are counterexamples. There is a version true for intuitionistic propositional (but not for predicate) logic, and more complicated version for the predicate case.
منابع مشابه
Glivenko Type Theorems for Intuitionistic Modal Logics
In this article we deal with Glivenko type theorems for intuitionistic modal logics over Prior’s MIPC. We examine the problems which appear in proving Glivenko type theorems when passing from the intuitionistic propositional logic Int to MIPC. As a result we obtain two different versions of Glivenko’s theorem for logics over MIPC. Since MIPC can be thought of as a one-variable fragment of the i...
متن کاملAN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملA short proof of Glivenko theorems for intermediate predicate logics
We give a simple proof-theoretic argument showing that Glivenko’s theorem for propositional logic and its version for predicate logic follow as an easy consequence of the deduction theorem, which also proves some Glivenko type theorems relating intermediate predicate logics between intuitionistic and classical logic. We consider two schemata, the double negation shift (DNS) and the one consisti...
متن کاملOn Interpolation in Existence Logics
In [2] Gentzen calculi for intuitionistic logic extended with an existence predicate were introduced. Such logics were first introduced by Dana Scott, who provided a proof system for it in Hilbert style. The logic seems particularly useful in settings where non constant domain Kripke models play a role. In this paper it is proved that these systems have interpolation and the Beth definability p...
متن کاملIntuitionistic Layered Graph Logic: Semantics and Proof Theory
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic that gives an account of layering. The logic is a bunched system, combining the usual intuitionistic connectives, together with a non-commutative, non-associative conj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 113 شماره
صفحات -
تاریخ انتشار 2001